首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   71654篇
  免费   13726篇
  国内免费   9456篇
电工技术   8461篇
技术理论   1篇
综合类   9125篇
化学工业   1398篇
金属工艺   1275篇
机械仪表   5407篇
建筑科学   1290篇
矿业工程   966篇
能源动力   1406篇
轻工业   685篇
水利工程   1120篇
石油天然气   798篇
武器工业   1263篇
无线电   12627篇
一般工业技术   4534篇
冶金工业   690篇
原子能技术   272篇
自动化技术   43518篇
  2024年   236篇
  2023年   1232篇
  2022年   2429篇
  2021年   2634篇
  2020年   2937篇
  2019年   2488篇
  2018年   2440篇
  2017年   2932篇
  2016年   3375篇
  2015年   4054篇
  2014年   5216篇
  2013年   5103篇
  2012年   6304篇
  2011年   6570篇
  2010年   5325篇
  2009年   5495篇
  2008年   5844篇
  2007年   6235篇
  2006年   4875篇
  2005年   4036篇
  2004年   3222篇
  2003年   2548篇
  2002年   1912篇
  2001年   1504篇
  2000年   1258篇
  1999年   948篇
  1998年   758篇
  1997年   608篇
  1996年   470篇
  1995年   346篇
  1994年   293篇
  1993年   228篇
  1992年   214篇
  1991年   109篇
  1990年   137篇
  1989年   99篇
  1988年   70篇
  1987年   27篇
  1986年   39篇
  1985年   39篇
  1984年   26篇
  1983年   32篇
  1982年   38篇
  1981年   23篇
  1980年   31篇
  1979年   15篇
  1978年   15篇
  1977年   12篇
  1975年   16篇
  1959年   9篇
排序方式: 共有10000条查询结果,搜索用时 171 毫秒
101.
针对强背景噪声干扰下轮对轴承故障特征微弱、难以准确检测的问题,提出了一种自适应改进高斯拉普拉斯(improved Laplacian of Gaussian,简称ILoG)算子的微弱故障检测方法。ILoG算子滤波器具有优良的信号突变特征检测能力,将其用于轮对轴承故障信号的冲击特征检测,同时利用水循环算法(water cycle algorithm,简称WCA)的寻优特性,并行搜寻筛选最佳的ILoG算子影响参数,通过对参数优化后ILoG算子滤波后信号做进一步包络解调分析,提取出轮对轴承微弱的故障特征信息。对实际轮对轴承外圈和内圈故障信号分析的结果表明,该方法可以有效检测出轴承微弱故障特征频率,故障检测效果优于小波阈值和多尺度形态学差值滤波方法。  相似文献   
102.
为了解决多线激光雷达在三维空间重构任务中数据吞吐量过大导致运算负担过重以及扫描俯仰范围有限的问题,本文提出了一种利用单线激光雷达与惯性测量单元GNSS/INS相互结合的多站点扫描空间重构方案及相应解算方法。首先使用单线激光雷达扫描待测空间获取三维尺度信息,然后将点云数据与对应的任意方向的航向角相结合,再利用四元数姿态解算获取各站点扫描的点云图像。为提高计算效率,使用迭代最近点算法实现站点间点云配准时,对待匹配点云数据筛选并更新。实验结果表明在保留点云数字特征前提下,单线激光雷达与GNSS/INS系统能够提高76%的运算速率。本文提出的硬件方案和解算方法不但能够实现较高的配准精度,与多线激光雷达方案相比工程成本也得到显著下降。  相似文献   
103.
In the present work, the free radical polymerization of styrene is modeled by considering the phenomenology of the process (a simplified model, which does not include the diffusional effects, gel, and glass effects) in combination with an empirical model represented by an artificial neural network. Differential evolution (DE) algorithm, belonging to the class of evolutionary algorithms, is applied for developing the neural models in optimal forms. For improving the results—predicted conversion and molecular weights as function of time, temperature, and initiator concentration—different combinations between phenomenological model and neural network are tested; also, individual and stacked neural networks have been developed for the polymerization process. This methodology based on hybrid models, including neural networks aggregated in stacks, provides accurate results.  相似文献   
104.
105.
Cell temperature and water content of the membrane have a significant effect on the performance of fuel cells. The current-power curve of the fuel cell has a maximum power point (MPP) that is needed to be tracked. This study presents a novel strategy based on a salp swarm algorithm (SSA) for extracting the maximum power of proton-exchange membrane fuel cell (PEMFC). At first, a new formula is derived to estimate the optimal voltage of PEMFC corresponding to MPP. Then the error between the estimated voltage at MPP and the actual terminal voltage of the fuel cell is fed to a proportional-integral-derivative controller (PID). The output of the PID controller tunes the duty cycle of a boost converter to maximize the harvested power from the PEMFC. SSA determines the optimal gains of PID. Sensitivity analysis is performed with the operating fuel cell at different cell temperature and water content of the membrane. The obtained results through the proposed strategy are compared with other programmed approaches of incremental resistance method, Fuzzy-Logic, grey antlion optimizer, wolf optimizer, and mine-blast algorithm. The obtained results demonstrated high reliability and efficiency of the proposed strategy in extracting the maximum power of the PEMFC.  相似文献   
106.
为了降低家具配送成本,提高物流效率,基于第三方物流配送模式,构建了以总行驶距离最短和车辆数最少为最优目标的开放式车辆路径问题(open vehicle routing problem,OVRP)数学模型,并设计了一个改进的两阶段禁忌搜索算法进行求解,第1阶段求解包含所有客户的TSP(traveling salesman problem)路径来作为第2阶段划分OVRP路径的基础.设计了一个随机动态禁忌表,并将"邻域算子编号"和"邻域交换点对"同时作为禁忌对象,避免了过度禁忌的情况.另外,对5个邻域算子进行了测试,表明采用由点交换、分序点插入、点逆序和前点前向插入这4个算子组成的多邻域结构体效果最佳.经算例测试和文献对比,验证了设计算法的有效性,采用第三方物流配送比自营物流配送更节省成本.  相似文献   
107.
The controller design for the robotic manipulator faces different challenges such as the system's nonlinearities and the uncertainties of the parameters. Furthermore, the tracking of different linear and nonlinear trajectories represents a vital role by the manipulator. This paper suggests an optimal design for the nonlinear model predictive control (NLMPC) based on a new improved intelligent technique and it is named modified multitracker optimization algorithm (MMTOA). The proposed modification of the MTOA is carried out based on opposition-based learning (OBL) and quasi OBL approaches. This modification improves the exploration behavior of the MTOA to prevent it from becoming trapped in a local optimum. The proposed method is applied on the robotic manipulator to track different linear and nonlinear trajectories. The NLMPC parameters are tuned by the MMTOA rather than the trial and error method of the designer. The proposed NLMPC based on MMTOA is compared with the original MTOA, genetic algorithm, and cuckoo search algorithm in literature. The superiority and effectiveness of the proposed controller are confirmed to track different linear and nonlinear trajectories. Furthermore, the robustness of the proposed method is emphasized against the uncertainties of the parameters.  相似文献   
108.
Disassembly Sequence Planning (DSP) refers to a disassembly sequence based on the disassembly properties and restrictions of the product parts that meets the benefit goal. This study aims to reduce the number of changes in disassembly direction and disassembly tools so as to reduce the disassembly time. This study proposes a novel Flatworm algorithm that evolves through the regenerative properties of the flatworm. It is similar to the evolutionary concept of genetic algorithms, with evolution as the main idea, but without crossover, mutation or replication mechanisms in the evolutionary processes. Instead, it is based upon the characteristics of the growth, fracture and regeneration mechanisms of the flatworm. The Flatworm algorithm features a variety of disassembly combinations and excellent mechanisms to avoid the local optimal solution. In particular, it has the advantage of keeping a good disassembly combination from being destroyed. In this study, it is compared with two genetic algorithms and two ant colony algorithms and tested in three examples of different complexity: a ceiling fan, a printer, and 150 simulated parts. The solution searching ability and execution time are compared upon the same evaluation standard. The test results demonstrate that the novel Flatworm algorithm proposed in this study is superior to the two genetic algorithms and ant colony algorithms in solution quality.  相似文献   
109.
The scheduling problems under distributed production or flexible assembly settings have achieved increasing attention in recent years. This paper considers scheduling the integration of these two environments and proposes an original distributed flowshop scheduling problem with flexible assembly and set-up time. Distributed production stage is deployed several homogeneous flowshop factories that process the jobs to be assembled into final products in the flexible assembly stage. The objective is to find a schedule, including a production subschedule for jobs and an assembly subschedule for products, to minimise the makespan. Such a scheduling problem involves four successive decisions: assigning jobs to production factories, sequencing jobs at every factory, designating an assembly machine for each product and sequencing products on each assembly machine. The computational model is first established, and then a constructive heuristic (TPHS) and two hybrid metaheuristics (HVNS and HPSO) are proposed. Numerical experiments have been carried out and results validate the algorithmic feasibility and effectiveness. TPHS can obtain reasonable solutions in a shorter time, while metaheuristics can report better solutions using more yet acceptable time. HPSO is statistically comparable yet less robust compared with HVNS for small-scale instances. For the large-scale case, HPSO outperforms HVNS on both effectiveness and robustness.  相似文献   
110.
国际电路不同于一般网内电路,具有跨多运营商、超长距离和级联组网的特性,这些特性给该类电路的故障定位带来挑战,但同时也形成其特有的规律。本文通过总结日常运维经验和分析各厂家设备告警信号传递规律,总结出可以用于计算机实现的国际电路故障定位算法。  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号